The cooperative estimation of distribution algorithm: a novel approach for semiconductor final test scheduling problems

A large number of studies have been conducted in the area of semiconductor final test scheduling (SFTS) problems. As a specific example of the simultaneous multiple resources scheduling (SMRS) problem, intelligent manufacturing planning and scheduling based on meta-heuristic methods, such as the genetic algorithm (GA), simulated annealing (SA), and particle swarm optimization (PSO), have become common tools for finding satisfactory solutions within reasonable computational times in real settings. However, only a few studies have analyzed the effects of interdependent relations during group decision-making activities. Moreover, for complex and large problems, local constraints and objectives from each managerial entity and their contributions toward global objectives cannot be effectively represented in a single model. This paper proposes a novel cooperative estimation of distribution algorithm (CEDA) to overcome these challenges. The CEDA extends a co-evolutionary framework incorporating a divide-andconquer strategy. Numerous experiments have been conducted, and the results confirmed that CEDA outperforms hybrid GAs for several SFTS problems.